Beyond Relaxation and Newton–Raphson: Solving AC OPF for Multi-Phase Systems With Renewables
نویسندگان
چکیده
منابع مشابه
Adaptive Firefly Algorithm based OPF for AC/DC Systems
Optimal Power Flow (OPF) is an important operational and planning problem in minimizing the chosen objective functions of the power systems. The recent developments in power electronics have enabled introduction of dc links in the AC power systems with a view of making the operation more flexible, secure and economical. This paper formulates a new OPF to embrace dc link equations and presents a...
متن کاملtight frame approximation for multi-frames and super-frames
در این پایان نامه یک مولد برای چند قاب یا ابر قاب تولید شده تحت عمل نمایش یکانی تصویر برای گروه های شمارش پذیر گسسته بررسی خواهد شد. مثال هایی از این قاب ها چند قاب های گابور، ابرقاب های گابور و قاب هایی برای زیرفضاهای انتقال پایاست. نشان می دهیم که مولد چند قاب تنک نرمال شده (ابرقاب) یکتا وجود دارد به طوری که مینیمم فاصله را از ان دارد. همچنین مسایل مشابه برای قاب های دوگان مطرح شده و برخی ...
15 صفحه اولOptimal Location of Facts Devices for Solving Multi Objective Opf Using Improved Shuffled Leaping Frog Algorithm
5.1 INTRODUCTION Nowadays wind farms contributing to the energy production is continuously growing because of their economical and environmental protection attraction. However, large wind farms have higher reactive power demand that may not be easily satisfied. Therefore, connecting the wind farms to the power network becomes a more challenging task and their impacts are likely to be more wides...
متن کاملHybrid Particle Swarm Optimization Approach for Solving OPF Problem
This paper presents a hybrid particle swarm optimization algorithm (HPSO) as a modern optimization tool to solve the optimal power flow (OPF) problem. The objective functions considered are the system real power losses, fuel cost, voltage deviation and voltage stability index. The proposed algorithm makes use of the PSO, known for its global searching capabilities, to allocate the optimal contr...
متن کاملSolving the Multi-depot Location- Routing Problem with Lagrangian Relaxation
Multi-depot Location-Routing Problem (MDLRP) is about finding the optimal number and locations of depots while allocating customers to depots and determining vehicle routes to visit all customers. In this study we propose a nested Lagrangian relaxation-based method for the discrete uncapacitated MDLRP. An outer Lagrangian relaxation embedded in subgradient optimization decomposes the parent pro...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: IEEE Transactions on Smart Grid
سال: 2018
ISSN: 1949-3053,1949-3061
DOI: 10.1109/tsg.2016.2645220